Complexity of Tree Homomorphisms
نویسندگان
چکیده
For a fixed oriented tree T, we consider the complexity of deciding whether or not a given digraph G is homomorphic to T. It was shown by Gutjahr, Woeginger and Welzl that there exist trees T for which this homomorphism problem is NP-complete. However, it seems difficult to decide just which trees T yield NP-complete homomorphism problems. In this paper, we first identify a class of simple trees with NP-complete homomorphism problems; these trees have exactly one vertex of degree 3 and all other vertices of degree 1 or 2. Our smallest tree has only 45 vertices. (The previous known smallest NP-complete tree has 81 vertices.) In order to gain insight into the structure of oriented trees T which have NP-complete homomorphism problems, we list all subtrees that are necessary in such oriented trees.
منابع مشابه
Constraint Satisfaction: Algorithms and Complexity Course Notes
1 Graph Homomorphisms 2 1.1 Graphs and Digraphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Graph Homomorphisms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3 The H-coloring Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.4 Cores . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.5 Polymorphism...
متن کاملMining Tree Patterns with Partially Injective Homomorphisms
One of the main differences between ILP and graph mining is that while pattern matching in ILP is mainly defined by homomorphism (subsumption), it is the subgraph isomorphism in graph mining. Using that subgraph isomorphisms are injective homomorphisms, we bridge the gap between the two pattern matching operators with partially injective homomorphisms, which are homomorphisms requiring the inje...
متن کاملStructured Parallel Computation in Structured Documents
Document archives contain large amounts of data to which sophisticated queries are applied. The size of archives and the complexity of evaluating queries makes the use of parallelism attractive. The use of semantically-based markup such as SGML makes it possible to represent documents and document archives as data types. We present a theory of trees and tree homomorphisms, modelling structured ...
متن کاملThe complexity of parity graph homomorphism: an initial investigation
Given a graph G, we investigate the problem of determining the parity of the number of homomorphisms from G to some other fixed graph H. We conjecture that this problem exhibits a complexity dichotomy, such that all parity graph homomorphism problems are either polynomial-time solvable or ⊕P–complete, and provide a conjectured characterisation of the easy cases. We show that the conjecture is t...
متن کاملHow to Prove Unsatisfiability by Homomorphisms
We define homomorphisms of boolean formulas in conjunctive normal form such that, if φ : F ′ → F is a homomorphism, then the unsatisfiability of F ′ implies the unsatisfiability of F . MU(1) denotes the class of minimal unsatisfiable formulas which have exactly one more clause than variables; it is known that MU(1) can be recognized in polynomial time. We show that MU(1) is homomorphically comp...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 70 شماره
صفحات -
تاریخ انتشار 1996